New Classification of Existing Stream Ciphers

Non

ECSC-128: New Stream Cipher Based On Elliptic Curve Discrete Logarithm Problem.

Ecsc-128 is a new stream cipher based on the intractability of the Elliptic curve discrete logarithm problem. The design of ECSC-l2g is divided into three important stages: Initialization Stage, Keystream Generation stage, and the Encryption Stage. The design goal of ECSC-128 is to come up with a secure stream cipher for data encryption. Ecsc-l2g was designed based on some hard mathematical problems instead of using simple logical operations. In terms of performance and security, Ecsc-l2g was slower, but it provided high level of security against all possible cryptanalysis attacks

Parallel Platform For New Secure Stream Ciphers Based On Np-hard Problems

Tujuan kajian ini adalah untuk mengenal pasti unsur-unsur utama reka bentuk sifer aliran yang selamat dan pantas. The purpose of this study was to identify the key elements for secure and fast stream cipher’s design. In cryptography

Neighbourhood communication model for enhancing trust and promoting players’ cooperative behavior: a case of iterated n-players prisoner’s dilemma

Human beings collaborate when organized in an unchanging network of social relationships and if the advantage of collaboration surpasses the entire cost of collaboration with all neighbours. Cooperation may be seen in community and natural systems when selfless action is rewarded despite the risk of exclusion. Trust between neighbours is crucial since cooperative behaviour spreads more rapidly and efficiently in environments with a high trust rating. In this paper, we introduce an alternative neighbourhood communication topology to enhance the level of trust between n prisoner’s dilemma players and promote cooperative behaviour. The proposed topology allows players to communicate with their local neighbours and share their experiences within the universe of other players that are not locally connected. To understand the overall players’ behaviour locally and globally, the topology is supported by a knowledge base accessible by all players. Our topology was tested against five other communication topologies over four 1000-game tournaments. The results show that our model outperforms other strategies in promoting cooperative behaviour among participating players in small and large populations

Strike: Stream Cipher Based on Stochastic Lightning Strike Behaviour

There is an increasing need for secure and fast encryption algorithms to support applications and communication protocols, and business models. In this paper, we present an alternative stream cipher (Strike) inspired by the stochastic behaviour of lightning strike phenomena. The novelty and originality of Strike stem from the utilisation of lightning strike behaviour as a source for generating random keystreams for encryption and decryption. Strike consists of three main functions: a function for setting up the security attributes, a function for generating lightning strikes and converting them to a keystream, and a function for plaintext encryption. The proposed stream cipher was tested against several cryptanalysis and statistical attacks in addition to other performance tests. The results show that Strike achieves high throughput on both high- and low-speed devices. Additionally, security analysis shows that our cipher is resistant to cryptanalysis and statistical attacks

An Approach for Detecting Feasible Paths Based on Minimal SSA Representation and Symbolic Execution

Static analysis is one of the techniques used today to analyze source codes and minimize the issue of software vulnerability. Static analysis has the ability to observe all possible software paths in an application through the scrutiny of a web application’s source code. Among those paths, some may be considered feasible paths, which refer to any paths that the test cases can execute. The detection of feasible paths in the results of a static analysis helps to minimize the false positive rate. However, the detection of feasible paths can be challenging, especially for programs that have multiple conditions in the same branch. The aim is to ensure that each feasible path is detected only once (not duplicated). This paper proposes an approach based on minimal static single assignment (MSSA) form and symbolic execution to detect feasible paths. The proposed approach starts by converting the source code into an abstract syntax tree (AST), followed by converting the AST to minimal SSA representation, which helps to decrease the number of instructions in the SSA form. An algorithm was built to examine all of the instructions of the SSA form, identify whole paths in the source code, and extract constraints along each path. A path weight method (PWM) is proposed in this work to avoid detecting duplicated feasible paths. The satisfiability modulo theory (SMT) solver was used to check the satisfiability of each path condition. The proposed approach was tested on seven well-known test programs that have been used in related studies and 10 large scale programs. The experimental results indicate that the proposed method (PWM) can avoid detecting duplicated feasible paths, and the proposed approach reduced the time required for generating the paths compared to that in related studies

Fixed Point Theorems in Symmetric Controlled <i>M</i>-Metric Type Spaces

One of the frequently studied approaches in metric fixed-point theory is the generalization of the used metric space. Under this approach, in this study, we introduce a new extension of M-metric spaces, called controlled M-metric spaces, achieved by modifying the triangle inequality and keeping the symmetric condition of the space. The investigation focuses on exploring fundamental properties of this newly defined space, incorporating topological aspects. Several fixed-point theorems and fixed-circle results are established within these spaces complemented by illustrative examples to demonstrate the implications of our findings. Moreover, we present an application involving high-degree polynomial equations